Generalized Discernibility Function Based Attribute Reduction in Incomplete Decision Systems
نویسندگان
چکیده
A rough set approach for attribute reduction is an important research subject in data mining and machine learning. However, most attribute reduction methods are performed on a complete decision system table. In this paper, we propose methods for attribute reduction in static incomplete decision systems and dynamic incomplete decision systems with dynamically-increasing and decreasing conditional attributes. Our methods use generalized discernibility matrix and function in tolerance-based rough sets.
منابع مشابه
Research on Complete Algorithms for Minimal Attribute Reduction
Minimal attribute reduction plays an important role in both theory and practice, but it has been proved that finding a minimal reduct of a given decision table is a NP-hard problem. Some scholars have also pointed out that current heuristic algorithms are incomplete for minimal attribute reduction. Based on the decomposition principles of a discernibility function, a complete algorithm CAMARDF ...
متن کاملFast Algorithm for Attribute Reduction Based on Rough Set Theory Using Binary Discernibility Matrix
Rough set is a valid mathematical tool that deals with uncertain, vague and incomplete information of decision systems. Attribute reduction is one of the issues in rough set theory, and core attributes are indispensable in the process of attribute reduction. Recently, some researchers proposed the method of binary discernibility matrix to compute the results of attribute reduction, which can no...
متن کاملEfficient Algorithm for Knowledge Reduction in Incomplete Information System
Rough set theory was proposed by Pawlak, which is a novel mathematical tool to deal with imprecise, uncertain and vague data. It has been widely applied in many fields such as machine learning, artificial intelligent and pattern recognition. Knowledge reduction plays an important role in decision support, fault diagnosis and classification problems. Irrelevant and redundant attributes in input ...
متن کاملDecision-relative discernibility matrices in the sense of entropies
In rough set theory, attribute reduction is a basic issue, which aims to hold the discernibility of the attribute set. To obtain all of the reducts of an information system or a decision table, researchers have introduced many discernibility matrixes based reduction methods. However, the reducts in the sense of positive region can only be obtained by using the existing discernibility matrixes. ...
متن کاملSymbolic Representation for Rough Set Attribute Reduction Using Ordered Binary Decision Diagrams
The theory of rough set is the current research focus for knowledge discovery, attribute reduction is one of crucial problem in rough set theory. Most existing attribute reduction algorithms are based on algebra and information representations, discernibility matrix is a common knowledge representation for attribute reduction. As problem solving under different knowledge representations corresp...
متن کامل